Cost evaluation in joins’ optimization

نویسنده

  • Nicoleta Liviana Tudor
چکیده

This article presents an approach of the cost model used in join optimization. The search space is determined through transformations on the query blocks, depending on the selection predicate. Different implementations of the JOIN operator are taken into account for cost evaluation of the execution plans. Subject Classification: 168P15.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evaluation of view maintenance with complex joins in a data warehouse environment

Data warehouse maintenance and maintenance cost has been well studied in the literature. Integrating data sources, in a data warehouse environment, may often need data cleaning, transformation, or any other function applied to the data in order to integrate it. The impact on view maintenance, when data is integrated with other comparison operators than defined in theta join, has, however, not b...

متن کامل

Optimization of Queries Including ADT Functions

Inclusion 01 ADTs (AbsWacr Dula Types) has been studied by many researchers as a promising feature to make the relational database meet requirements from non-traditional advanced applications. In databases which support ADTs, the execution cost of a selection involving ADT functions (shortly, ADT selecdun) may be equal to or possibly more than that of a join, since the evaluation of a computati...

متن کامل

Efficient Evaluation of the Valid-Time Natural Join

Joins are arguably the most important relational operators. Poor implementations are tantamount to computing the Cartesian product of the input relations. In a temporal database, the problem is more acute for two reasons. First, conventional techniques are designed for the optimization of joins with equality predicates, rather than the inequality predicates prevalent in valid-time queries. Seco...

متن کامل

Advanced Cardinality Estimation in the XML Query Graph Model

Reliable cardinality estimation is one of the key prerequisite for effective cost-based query optimization in database systems. The XML Query Graph Model (XQGM) is a tuple-based XQuery algebra that can be used to represent XQuery expressions in native XML database management systems. This paper enhances previous works on reliable cardinality estimation for XQuery and introduces several inferenc...

متن کامل

A Cost Model for Path Expressions in Object-Oriented Queries

Query processing remains one of the important challenges of Object-Oriented Database Management Systems. Cost based query optimization involves creating alternative executing plans for a given query and executing the least costly one within a cost model framework. In Object-Oriented Database Management Systems (OODBMSs) objects may store references to other objects (precomputed joins), and path...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006